Listar por autor 

Listar por autor "Seara Ojea, Carlos"  

Mostrando ítems 1-11 de 11

    • Ponencia
      Icon

      (a, k)-sets en el plano 

      Abellanas Oar, Manuel; Claverol Aguas, Mercè; Hurtado Díaz, Ferran; Seara Ojea, Carlos (Alberto Márquez, 2002)
    • Artículo
      Icon

      Covering point sets with two disjoint disks or squares 

      Cabello, Sergio; Díaz Báñez, José Miguel; Seara Ojea, Carlos; Sellarés, J. Antoni; Urrutia, Jorge; Ventura Molina, Inmaculada (Elsevier, 2007)
      We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR ...
    • Artículo
      Icon

      Fitting a two-joint orthogonal chain to a point set 

      Díaz Báñez, José Miguel; Amaro López, M. A.; Mora, M.; Seara Ojea, Carlos; Ventura Molina, Inmaculada (Elsevier, 2010)
      We study the problem of fitting a two-joint orthogonal polygonal chain to a set S of n points in the plane, where the ...
    • Artículo
      Icon

      On finding widest empty curved corridors 

      Bereg, Sergey; Díaz Báñez, José Miguel; Seara Ojea, Carlos; Ventura Molina, Inmaculada (Elsevier, 2007)
      An α-siphon of width w is the locus of points in the plane that are at the same distance w from a 1-corner polygonal chain ...
    • Ponencia
      Icon

      On geodesic and monophonic convexity 

      Hernando Martin, Maria del Carmen; Mora Gine, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos (2004)
      In this paper we deal with two types of graph convexities, which are the most natural path convexities in a graph and which ...
    • Artículo
      Icon

      Separability of Point Sets by k-Level Linear Classification Trees 

      Arkin, Esther M.; Garijo Royo, Delia; Márquez Pérez, Alberto; Mitchell, Joseph S. B.; Seara Ojea, Carlos (2012)
      Let R and B be sets of red and blue points in the plane in general position. We study the problem of computing a k-level ...
    • Artículo
      Icon

      Stabbers of line segments in the plane 

      Claverol, Mercé; Garijo Royo, Delia; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Seara Ojea, Carlos (2011)
      The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner ...
    • Artículo
      Icon

      Stabbing segments with rectilinear objects 

      Claverol Aguas, Mercé; Garijo Royo, Delia; Korman, Matias; Seara Ojea, Carlos; Silveira Isoba, Rodrigo Ignacio (Elsevier, 2017)
      Given a set S of n line segments in the plane, we say that a region R R2 is a stabber for S if R contains exactly one ...
    • Ponencia
      Icon

      The alternating path problem revisited 

      Claverol Aguas, Mercè; Garijo Royo, Delia; Hurtado Díaz, Ferran; Lara Cuevas, María Dolores; Seara Ojea, Carlos (2013)
      It is well known that, given n red points and n blue points on a circle, it is not always possible to find a plane geometric ...
    • Artículo
      Icon

      The class cover problem with boxes 

      Bereg, Sergey; Cabello, S.; Díaz Báñez, José Miguel; Pérez Lantero, Pablo; Seara Ojea, Carlos; Ventura Molina, Inmaculada (Elsevier, 2012)
      In this paper we study the following problem: Given sets R and B of r red and b blue points respectively in the plane, ...
    • Ponencia
      Icon

      The siphon problem 

      Díaz Báñez, José Miguel; Seara Ojea, Carlos; Ventura Molina, Inmaculada (2004)
      An α-siphon is the locus of points in the plane that are at the same distance ǫ from a polygonal chain consisting of two ...